Optimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks
There has been recent interest within the networking research community to understand how mobility can improve the capacity of mobile ad hoc networks. Of particular interest is the achievable capacity under delay constraints. In this paper, we establish the following upper bound on the optimal capacity-delay tradeoff in mobile ad hoc networks for an i.i.d. mobility model. For a mobile ad hoc ne...
متن کاملOptimal Delay-Throughput Tradeoffs in Mobile Ad Hoc Networks
In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks. We consider four node mobility models: (1) two-dimensional i.i.d. mobility, (2) twodimensional hybrid random walk, (3) one-dimensional i.i.d. mobility, and (4) one-dimensional hybrid random walk. Two mobility time-scales are included in this paper: (i) Fast mobility where node mobility is at the same time-s...
متن کاملSecrecy Transmission Capacity in Noisy Wireless Ad Hoc Networks
This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the legitimate nodes and the eavesdroppers are distributed as Poisson point processes, we study the secrecy transmission capacity (STC), as well as the connection o...
متن کاملSource Delay in Mobile Ad Hoc Networks
Source delay, the time a packet experiences in its source node, serves as a fundamental quantity for delay performance analysis in networks. However, the source delay performance in highly dynamic mobile ad hoc networks (MANETs) is still largely unknown by now. This paper studies the source delay in MANETs based on a general packet dispatching scheme with dispatch limit f (PD-f for short), wher...
متن کاملCritical Node Detection in Large Scale Mobile Ad hoc Networks
Reliability calculation of large scale MANETs is an NP computational problem, and this complexity can be reduced by identifying critical nodes in a network. The identification of critical nodes itself is a computationally hard problem. The present work provides an empirical Algorithm for detecting critical nodes in a MANET which is computationally efficient than the already existing detection m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2016
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2015.2405793